Backbone Coloring of Graphs with Galaxy Backbones
نویسندگان
چکیده
منابع مشابه
Optimal backbone coloring of split graphs with matching backbones
For a graph G with a given subgraph H, the backbone coloring is defined as the mapping c : V (G) → N+ such that |c(u)− c(v)| ≥ 2 for each edge {u, v} ∈ E(H) and |c(u)− c(v)| ≥ 1 for each edge {u, v} ∈ E(G). The backbone chromatic number BBC(G,H) is the smallest integer k such that there exists a backbone coloring with maxv∈V (G) c(v) = k. In this paper, we present the algorithm for the backbone...
متن کاملBackbone coloring for graphs with large girths
For a graph G and a subgraph H (called backbone graph) of G, a backbone k-coloring of G with respect to H is a proper vertex coloring of G using colors from the set {1, 2, . . . , k}, with an additional condition that colors for any two adjacent vertices in H must differ by at least two. The backbone chromatic number of G over H, denoted by BBC(G,H), is the smallest k of a backbone k-coloring a...
متن کاملThe λ-backbone colorings of graphs with tree backbones
The λ-backbone coloring is one of the various problems of vertex colorings in graphs. Given an integer λ ≥ 2, a graph G = (V,E), and a spanning subgraph (backbone) H = (V, EH) of G, a λ-backbone coloring of (G,H) is a proper vertex coloring V → {1, 2, ...} of G in which the colors assigned to adjacent vertices in H differ by at least λ. The λ-backbone coloring number BBCλ(G,H) of (G,H) is the s...
متن کاملBackbone colouring: Tree backbones with small diameter in planar graphs
Given a graph G and a spanning subgraph T of G, a backbone k-colouring for (G,T ) is a mapping c : V (G)→ {1, . . . ,k} such that |c(u)− c(v)| ≥ 2 for every edge uv ∈ E(T ) and |c(u)− c(v)| ≥ 1 for every edge uv ∈ E(G) \E(T ). The backbone chromatic number BBC(G,T ) is the smallest integer k such that there exists a backbone k-colouring of (G,T ). In 2007, Broersma et al. [2] conjectured that B...
متن کاملBackbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone coloring for G and H is a proper vertex coloring V → {1, 2, . . .} of G in which the colors assigned to adjacent vertices in H differ by at least two. We study the cases where the backbone is either a spanning tree or a spa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2019
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2019.08.006